More Effort Towards Multiagent Knapsack

In this paper, we study two multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] studied model in which each agent expresses its preference by assigning a utility to every item. They three aggregation rules for finding subset (knapsack) items: individually best, diverse, and Nash welfare-based. Informally, diversity is achieved satisfying as many agents possible. Motivated application operators multiwinner elections, extend from diverse rule Median Best scoring functions. We computational parameterized complexity problem with respect some natural parameters, namely, number agents, items, distance an easy instance. also under domain restrictions. Furthermore, present significantly faster algorithms rule.